Geometric determination of shared travel routes

ABSTRACT

A method, computer program product, and computer system are provided for determining a convenient route. The method includes, for instance: obtaining, by a processor, a route that includes a starting point and an ending point; analyzing the route to determine whether at least one stored route is within a pre-defined acceptance zone of the route; and responsive to determining that at least one stored route is within a pre-defined acceptance zone, assigning a convenience factor of the at least one stored route relative to the route.

This application claims priority from U.S. Non-provisional patentapplication Ser. No. 13/939,541, filed on Jul. 11, 2013 and isincorporated herein by reference, in its entirety, for all purposes.

BACKGROUND

An aspect of the technique relates to enabling individual travelers tomaximize resources, including but not limited to time and capital, whileimproving efficiency in locating an effective travel plan.

Throughout the world, people tend to travel independently, withoutknowing one another's routes. When people share routes they canpotentially gain time and save money, but they can potentially sacrificethe convenience of riding alone. An aspect of the technique evaluatespotential routes of travel and recommended only geographicallyconvenient routes, while filtering inconvenient routes.

BRIEF SUMMARY

Shortcomings of the prior art are overcome and additional advantages areprovided through the provision of a method for determining a convenientroute. The method includes, for instance: obtaining, by a processor, aroute wherein said route comprises a starting point and an ending point;analyzing the route to determine whether at least one stored route iswithin a pre-defined acceptance zone of the route; and responsive todetermining that at least one stored route is within a pre-definedacceptance zone, assigning a convenience factor of the at least onestored route relative to the route.

Computer systems and computer program products relating to one or moreaspects of the technique are also described and may be claimed herein.Further, services relating to one or more aspects of the technique arealso described and may be claimed herein.

Additional features are realized through the techniques of the presentinvention. Other embodiments and aspects of the invention are describedin detail herein and are considered a part of the claimed invention.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

One or more aspects of the present invention are particularly pointedout and distinctly claimed as examples in the claims at the conclusionof the specification. The foregoing and objects, features, andadvantages of one or more aspects of the invention are apparent from thefollowing detailed description taken in conjunction with theaccompanying drawings in which:

FIG. 1 depicts one example of a computing environment used to executeone or more aspects of an embodiment of the present invention;

FIG. 2 depicts a workflow of one embodiment of a method for locating ashared route for a traveler, in accordance with one or more aspects ofthe present invention

FIG. 3 depicts one or more aspects of an embodiment of the presentinvention;

FIG. 4 depicts one or more aspects of an embodiment of the presentinvention;

FIG. 5 depicts one or more aspects of an embodiment of the presentinvention;

FIG. 6 depicts one or more aspects of an embodiment of the presentinvention;

FIG. 7 depicts one or more aspects of an embodiment of the presentinvention;

FIG. 8 depicts one or more aspects of an embodiment of the presentinvention;

FIG. 9 depicts one or more aspects of an embodiment of the presentinvention;

FIG. 10 depicts one or more aspects of an embodiment of the presentinvention.

FIG. 11 depicts one or more aspects of an embodiment of the presentinvention.

FIG. 12 depicts one or more aspects of an embodiment of the presentinvention.

FIG. 13 depicts one embodiment of a single processor computingenvironment to incorporate and use one or more aspects of the presentinvention; and

FIG. 14 depicts one embodiment of a computer program productincorporating one or more aspects of the present invention.

DETAILED DESCRIPTION

The technique represents an improvement over prior systems and methodsof recommending shared travel routes for different users because itevaluates available shared travel routes within a configurableconvenience tolerance and recommends available shared travel routes in auser-friendly manner where the user comprehends resource to conveniencetrade-offs. This consolidation of travel is commonly referred to as“ride-sharing.”

FIG. 1 depicts one example of a computing environment 100 used toexecute one or more aspects of an embodiment of the present invention.In this embodiment, a computer system 110, which can include a cloudand/or an enterprise system, is accessible by one or more terminals 120a-120 e. Computer system 110 can also be a single computer resource. Theterminals access the one or more resources of the computer system 110via a network connection 130, including but not limited to a LAN, aWLAN, and/or an Internet connection.

In this embodiment, computer system 110 contains one or more servers,such as web servers, that serve content to the terminals 120 a-120 eover the network connection 130.

In this embodiment, each of the terminals 120 a-120 e includes at leastone processor (not pictured) and at least one memory resource (notpictured). The terminals 120 a-120 e are capable of executing a clientprogram on the terminals 120 a-120 e, including but not limited to athin client, such as a web browser, which users of the terminals 120a-10 e utilize to interact with a client application 140 executed on oneor more resources of the computer system 110. In this embodiment, theclient application 140, which is comprised of computer readable programcode, is depicted as residing on one of the resources of the computersystem 110. The terms “computer readable program code” and software areused interchangeably and both refer to logic executed by processingcircuits on computer resources.

In further embodiments of the present invention, the client application140 is installed on one or more resources of the computer system 110and/or one or more computer resources accessible to one or moreresources of the computer system 110.

A user utilizing a terminal 120 a-120 e uses the present technique tosearch for a shared route for a trip that he or she is planning ontaking. By sharing a ride with another individual who is planning adifferent trip, the two individuals can combine resources. The computingenvironment 100 of FIG. 1 is utilized to practice an aspect of thetechnique described in FIG. 2.

In an aspect of the present technique, a processor executing computerprogram code treats routes associated with trips as vectors, each havinga magnitude and direction. Users utilize terminals 120 a-120 e to enterdesired routes, by entering at least a starting point and an endingpoint, and to search for convenient routes. When a given user enters aroute, the computer program code retains the route on an accessiblememory resource. The processor executing computer program codeidentifies whether a given route is convenient by comparing the angleand length of the entered route's vector with the angles and lengths ofother route vectors retained in the memory resource. The routes that thecomputer program code executing on one or more processors deemsconvenient are displayed to a user on a terminal 120 a-120 e.

In an embodiment of the present invention, the memory resource includes,but is not limited to, a database, and includes both local and/or remotedatabase to the one or more resources in the computer system 110executing this program code.

When evaluating and identifying whether a potential route stored on amemory resource is convenient, as compared with a newly entered route,the computer program code identifies if the angle of the entered routehas a similar angle to other routes in the memory resource, and thelength of the entered route is similar to other routes in the memoryresource, plus the lengths of the “out of the way” routes then the routewill be considered convenient. The computer program code quantifies theconvenience of the route by dividing the searched route length by theroute length in the memory resource and adding the “out of the way”route lengths. The method is described in greater detail in FIGS. 2-10.

As displayed in FIG. 2, a method 200 of an embodiment of the presentinvention includes, the computer program code obtaining routes enteredon terminals 120 a-120 e by users (S210). The routes represent desiredtrips that these travelers wish to take. The travelers, for the sake ofconserving resources, hope to share travel resources, such as a car,with other travelers. Sharing of routes includes, but is not limited to,two travelers traveling together and a traveler transporting entitiesfor another traveler.

The computer program code then retains these routes (S220). In anembodiment of the present invention, the computer program code retainseach route as a vector with a length and a direction.

The computer program code obtains a new route (S230). This new route canbe entered, for example, by a user employing a terminal 120 a-120 e.

The computer program code compares the new route to the retained routesand identifies which on the retained routes are within an angularacceptance zone (S240) as compared to the new route. This analysis andthe angular acceptance zone are discussed in greater detail in FIGS.5-6.

After selecting the routes within the angular acceptance zone, thecomputer program product determines the distance from the start point ofthe new route to the start point of each selected route, each routewithin the angular acceptance zone, and the distance from the end pointof the new route to the end point of each selected route (S250). Thus,for each selected route, the computer program code has calculated twodistance values, which can be understood as “out-of-the-way” distancevalues. FIG. 9 depicts an example of the calculation of the distancevalues.

Utilizing the calculated distances and a match threshold, which isdiscussed in greater detail in reference to FIG. 10 and Equations 1-2,computer program code in an embodiment of the present techniquedetermines the convenience factor for each route within the angulartolerance zone (S260).

The computer program code returns to the user, the saved routes withqualifying convenience factors (S270). The computer program code cansupply this result by displaying the results on the terminal, email,SMS, MMS, or using any other notification system known in the art. Thecomputer program code that determines which routes have qualifyingconvenience factors is discussed in greater detail with reference toFIG. 10 and Equations 1-2.

FIG. 3 illustrates an aspect of an embodiment of the technique. FIG. 3is map of New York 300 superimposed with routes 1-6 entered by usersutilizing terminals 120 a-120 e and retained by the computer programcode executing on one or more resources of the computer system 110 andsaved on one or more memory resources of the computer system 110. Thenumber of routes depicted in FIG. 3 are examples. The number of routesis unlimited.

In FIG. 3, the routes 1-6 are represented as vectors, each having amagnitude and angle. The computer program code determines the angle ofeach route by comparing it to a pre-defined configurable direction. Inthe embodiment of FIG. 3, the computer program code determines theangles of each route by comparing the direction of each route to thedirection of due East. The computer program obtains the direction ofeach route as pointing from the departure point to the arrival point.

For clarity, FIG. 4 displays the routes 1-6 of FIG. 3 without the map300 in the background.

In an embodiment of the present technique, the vectors displayed inFIGS. 3-4 represent routes 1-6 that have been entered by users andretained on a memory resource for comparison with subsequently enteredroutes.

In addition to retaining previously entered routes, the computer programcode also has a preconfigured angular acceptance zone. The angularacceptance zone, which is configurable by a user accessing the programthrough, for example, a terminal 120 a-120 e. The angular acceptancezone represents the maximum angular deviation of one route from anotherroute wherein the computer program code will still determine that thesetwo routes are “convenient” to each other. Put plainly, potentiallyconvenient routes must have an angle that fits inside the angularacceptance zone. The angular acceptance zone is explained in greaterdetail in reference to FIG. 6.

As seen in FIG. 5, a user enters a new route 510 using a terminal 120a-120 e. Upon obtaining the new route 510, which comprises at least astarting point and a destination, entered as addresses, coordinates,etc., the computer program code executed on, for example, the computersystem 110, compares the new route 510, to the existing routes 1-6retained on a memory resource, such as a database.

As shown in FIG. 6, applying the angular acceptance zone, the computerprogram code creates an angular filter 620 based on the angle of the newroute 510. As shown in FIG. 6, an exemplary embodiment of the presenttechnique, potentially convenient routes must have an angle that fitsinside the angular acceptance zone 620. In FIG. 6, a first potentialroute 630 and a second potential route 640 represent the angular largestdeviation from the new route 510 that the computer program code willidentify as convenient.

Referring to FIG. 7, of the existing routes previously entered by users,the computer program utilizes the vectors representing the existingsaved routes and identifies a first route 770 and a second route 780 asboth having angles that fit inside the angular acceptance zone of thenew route 510. In an embodiment of the present technique, the computerprogram code further evaluates the routes, in this example, the firstroute 770 and the second route 780 that fall inside the angularacceptance zone.

FIG. 8 depicts the first route 770 and the second route 780 as well asthe new route 510 as they appear on a map of New York State. Note thatin this embodiment, the computer program code has selected the firstroute 770 and the second route 780 because they fall within apreconfigured angular acceptance zone, even though the routes aregeographically separate.

In the embodiment of the technique, in addition to isolating routesutilizing the aforementioned angular analysis, the computer program codefurther filters potential routes based on the distances the personentering the new route 510 must go out of his or her way to accommodatethe existing route in the database. In FIG. 9, lines 910 a-910 brepresents this distance between the new route 510 and the first route770 and lines 920 a-920 b represent this distance between new route 510and the second route 780. A shorter distance is more convenient for theuser and hence, the computer program code associates a greaterconvenience factor when a closer route is higher.

In an embodiment of the present invention, as calculated by the computerprogram code, the total distance a user travels is the length of theroute retained on a memory resource, for example the first route 770 orthe second route 780, plus the sum of the lengths of the two virtualroutes, for example line 910 a-910 b for the first route 770 and lines920 a-920 b for the second route.

Once the computer program code calculates the total distances, thelength of the entered route is divided by the total distance and ismultiplied by 100. The result is termed a convenience factor (CF), whichis a quantitative number representing the convenience of a route.

The range of convenience factors that represent potential alternate(shared) routes for a user who entered a new route 510, can be a staticvariable or can be configured by a user. This term can be referred to asa match threshold (MT). The computer program code applies the MT to theconvenience factors for potential routes in determining whether torecommend a given route to a user, via a client application, such as aweb browser, running on the terminal 120 a-120 e utilized by that user.

If the computer program code determined that the CF is greater than amatch threshold (MT), then the route is shown to the user, and theconvenience factor is shown to the user. In the example below, the MT is90%.

As explained above, a route is convenient if the CF is greater than, inthe example below, the MT. Equation 1 depicts the computer program codecalculating a convenience factor and comparing it to an MT of 0.90.

{(length of new route)/(length of saved route)+(length of distance fromdeparture point of saved route to departure point of new route)+(lengthof distance from arrival point of saved route to arrival point of newroute)}>0.90   Equation 1

Equation 2 utilizes sample data in Equation 1. The values in theseequations are non-limiting examples. The values in Equation 2 representthose depicted in FIG. 10. Referring to FIG. 10, it depicts the newroute 510, the second route 780 and lines 920 a-920 b, which representthe distances between the starting and ending points of the new route510 to the starting and ending points of the second route 780. As seenin FIG. 10, the length of the new route 510 is 160 miles. Line 920 a is10 miles while line 920 b is 15 miles. The second route is 150 miles.Thus, when Equation 1 is populated with values from this non-limitingexample, the result is Equation 2.

{(160 miles)/(150 miles+10 miles+15 miles)}=0.914 0.914>0.90

In the example from FIG. 10, the computer program code finds that thesecond route 780 convenient to the user who entered the new route 510because the convenience factor of the second route, 0.914, is greaterthan the match threshold of 0.90. In an embodiment of the presentinvention, the second route 510 is displayed to the user who entered thenew route 510. Because the first route 770 is more distant from the newroute 510, its convenience factor will fall below the threshold and thecomputer program code will not display the first route to the user.

In an embodiment of the present invention, when the computer programcode determined that more than one route has a qualifying conveniencefactor, the computer program code displays the qualifying routes. Theroutes can all be displayed together and/or ranked according to theirrespective convenience factors and/or using any display and/or listingfamiliar to one of skill in the art.

The embodiments discussed with reference to the FIGS. 1-10 refer totravelers choosing to share rides by finding routes with qualifyingconvenience factors. However, one of skill in the art will recognizeapplications for the present method beyond this ride sharing example.For example, a user looking to ship goods for a given route could use anembodiment of the present invention to locate a user who intends totravel a route with a qualifying convenience factor, where this user isable to haul the goods of the first user. In an embodiment of thepresent invention where a user desires to transport goods, additionalinformation may be obtained by the computer program, including thehauling capacity of the travel vehicle of each rider and whether itpossesses certain qualities that accommodate specific goods, forexample, is a given user traveling in a truck with refrigeration. In afurther embodiment of the present invention, a user may indicate howmuch room he or she has for dedicated cargo in his or her vehicle. Userswho locate and select rides with qualifying convenience factors may havethe option to “fill” a certain amount of available space on the selectedride, so that the ride is shown as available, but with less space toaccommodate cargo.

Although the embodiments in FIGS. 3-10 depict the routes as straightlines, in further embodiments of the present invention, routes may takeon additional shapes, for example, routes may be curved, to match thecurvature of the earth.

FIGS. 11-12 depict screen shots of a software application, specificallythe graphical user interface (GUI), depicting aspects of the presenttechnique. In the description of these figures, reference will be madeto the workflow of FIG. 2.

FIG. 11 is an example of a GUI and is not limiting. In FIG. 11, a useris requested to enter a departure zipcode and an arrival zipcode, inaddition to the day that he or she intends to take the trip. The usercan also enter additional information which some embodiments of theapplication can utilize to further limit the number of results forpossible shares returned to the user. For example, if a first userenters that he or she intends to transport a dog on the trip and asecond user writes that he or she is violently allergic to dogs, even ifthe route of the first user would be convenient to the second user, thisroute could be eliminated from the possible share opportunitiespresented to the user. As another example, a user could enter how manyspaces for passengers (and/or how much space for cargo) is available fora given trip. Utilizing the zipcode to establish a starting point and anend point to a trip is just one example of a start point and an endpoint that can be accepted by differing embodiments of the presentinvention. One of skill in the art will recognize that geographiccoordinates can be conveyed and accepted in a variety of ways.

Additionally, in an embodiment of the present invention, the terminal120 a-120 b can be enabled with GPS and the starting point of the useraccepted by the embodiment is the location of the user, as establishedby the GPS.

As discussed in reference to FIG. 2, after a user has entered a routeand the application has obtained this route and determined convenientroutes to this route, the application returns these candidate routes tothe user. FIG. 12 is an example of an embodiment of the presentinvention displaying a group of candidate routes to a user who hasentered a desired route. In this embodiment, the convenience of theroutes displayed is denoted by percentages and are listed in by mostconvenient to least convenient. One of skill in the art will recognizethat the routes can be displayed by embodiments of the applicationutilizing various graphical representations; FIG. 12 is one example.

Referring to FIG. 12, a user of a terminal 120 a-120 e, such as those inFIG. 1, enters route information. In this example, the GUI of FIG. 12gives the user the choice of entered a route for sharing, allowing theapplication to obtain the route S210, or finding the route, i.e.,requesting that the application search existing retained routes to seeif any of these routes are convenient to the user (S240-S270).

In another embodiment of the present invention, when the computerprogram presents existing retained routes to a user, the user may selecta route that he or she wishes to take. Upon selecting of the route, thecomputer program can notify user who entered that route that his or herroute has been selected and, for example, can send this notified userinformation about the user who selected the route, including whataccommodations the user requesting the route needs, for example, howmany people will be traveling, what cargo will come with the user, etc.In an embodiment of the present invention, the computer program cantrack when a selected route is “full,” i.e., the maximum capacity of thevehicle is full based upon selection by users, and remove the route fromthe pool of routes evaluated for sharing.

FIG. 13 illustrates a block diagram of a resource 1300 in computersystem 110 and/or terminal 120 a-120 b, which is part of the technicalarchitecture of certain embodiments of the technique. The resource 1300may include a circuitry 370 that may in certain embodiments include amicroprocessor 354. The computer system 1100 may also include a memory355 (e.g., a volatile memory device), and storage 181. The storage 181may include a non-volatile memory device (e.g., EEPROM, ROM, PROM, RAM,DRAM, SRAM, flash, firmware, programmable logic, etc.), magnetic diskdrive, optical disk drive, tape drive, etc. The storage 355 may comprisean internal storage device, an attached storage device and/or a networkaccessible storage device. The system 1100 may include a program logic330 including code 333 that may be loaded into the memory 355 andexecuted by the microprocessor 356 or circuitry 370.

In certain embodiments, the program logic 330 including code 333 may bestored in the storage 181, or memory 355. In certain other embodiments,the program logic 333 may be implemented in the circuitry 370.Therefore, while FIG. 13 shows the program logic 333 separately from theother elements, the program logic 333 may be implemented in the memory355 and/or the circuitry 370.

Using the processing resources of a resource 1300 to execute software,computer-readable code or instructions, does not limit where this codeis can be stored. Referring to FIG. 14, in one example, a computerprogram product 1400 includes, for instance, one or more non-transitorycomputer readable storage media 1402 to store computer readable programcode means or logic 1404 thereon to provide and facilitate one or moreaspects of the technique.

As will be appreciated by one skilled in the art, aspects of thetechnique may be embodied as a system, method or computer programproduct. Accordingly, aspects of the technique may take the form of anentirely hardware embodiment, an entirely software embodiment (includingfirmware, resident software, micro-code, etc.) or an embodimentcombining software and hardware aspects that may all generally bereferred to herein as a “circuit,” “module” or “system”. Furthermore,aspects of the technique may take the form of a computer program productembodied in one or more computer readable medium(s) having computerreadable program code embodied thereon.

Any combination of one or more computer readable medium(s) may beutilized. The computer readable medium may be a computer readable signalmedium or a computer readable storage medium. A computer readable signalmedium may include a propagated data signal with computer readableprogram code embodied therein, for example, in baseband or as part of acarrier wave. Such a propagated signal may take any of a variety offorms, including, but not limited to, electro-magnetic, optical or anysuitable combination thereof. A computer readable signal medium may beany computer readable medium that is not a computer readable storagemedium and that can communicate, propagate, or transport a program foruse by or in connection with an instruction execution system, apparatusor device.

A computer readable storage medium may be, for example, but not limitedto, an electronic, magnetic, optical, electromagnetic, infrared orsemiconductor system, apparatus, or device, or any suitable combinationof the foregoing. More specific examples (a non-exhaustive list) of thecomputer readable storage medium include the following: an electricalconnection having one or more wires, a portable computer diskette, ahard disk, a random access memory (RAM), a read-only memory (ROM), anerasable programmable read-only memory (EPROM or Flash memory), anoptical fiber, a portable compact disc read-only memory (CD-ROM), anoptical storage device, a magnetic storage device, or any suitablecombination of the foregoing. In the context of this document, acomputer readable storage medium may be any tangible medium that cancontain or store a program for use by or in connection with aninstruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmittedusing an appropriate medium, including but not limited to wireless,wireline, optical fiber cable, RF, etc., or any suitable combination ofthe foregoing.

Computer program code for carrying out operations for aspects of thetechnique may be written in any combination of one or more programminglanguages, including an object oriented programming language, such asJava, Smalltalk, C++ or the like, and conventional proceduralprogramming languages, such as the “C” programming language, assembleror similar programming languages. The program code may execute entirelyon the user's computer, partly on the user's computer, as a stand-alonesoftware package, partly on the user's computer and partly on a remotecomputer or entirely on the remote computer or server. In the latterscenario, the remote computer may be connected to the user's computerthrough any type of network, including a local area network (LAN) or awide area network (WAN), or the connection may be made to an externalcomputer (for example, through the Internet using an Internet ServiceProvider).

Aspects of the technique are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems) and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer program instructions. These computer program instructions maybe provided to a processor of a general purpose computer, specialpurpose computer, or other programmable data processing apparatus toproduce a machine, such that the instructions, which execute via theprocessor of the computer or other programmable data processingapparatus, create means for implementing the functions/acts specified inthe flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in a computerreadable medium that can direct a computer, other programmable dataprocessing apparatus, or other devices to function in a particularmanner, such that the instructions stored in the computer readablemedium produce an article of manufacture including instructions whichimplement the function/act specified in the flowchart and/or blockdiagram block or blocks.

The computer program instructions may also be loaded onto a computer,other programmable data processing apparatus, or other devices to causea series of operational steps to be performed on the computer, otherprogrammable apparatus or other devices to produce a computerimplemented process such that the instructions which execute on thecomputer or other programmable apparatus provide processes forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

The flowchart and block diagrams in the figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods and computer program products according to variousembodiments of the technique. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof code, which comprises one or more executable instructions forimplementing the specified logical function(s). It should also be notedthat, in some alternative implementations, the functions noted in theblock may occur out of the order noted in the figures. For example, twoblocks shown in succession may, in fact, be executed substantiallyconcurrently, or the blocks may sometimes be executed in the reverseorder, depending upon the functionality involved. It will also be notedthat each block of the block diagrams and/or flowchart illustration, andcombinations of blocks in the block diagrams and/or flowchartillustration, can be implemented by special purpose hardware-basedsystems that perform the specified functions or acts, or combinations ofspecial purpose hardware and computer instructions.

In addition to the above, one or more aspects of the technique may beprovided, offered, deployed, managed, serviced, etc. by a serviceprovider who offers management of customer environments. For instance,the service provider can create, maintain, support, etc. computer codeand/or a computer infrastructure that performs one or more aspects ofthe technique for one or more customers. In return, the service providermay receive payment from the customer under a subscription and/or feeagreement, as examples. Additionally or alternatively, the serviceprovider may receive payment from the sale of advertising content to oneor more third parties.

In one aspect of the technique, an application may be deployed forperforming one or more aspects of the technique. As one example, thedeploying of an application comprises providing computer infrastructureoperable to perform one or more aspects of the technique.

As a further aspect of the technique, a computing infrastructure may bedeployed comprising integrating computer readable code into a computingsystem, in which the code in combination with the computing system iscapable of performing one or more aspects of the technique.

As yet a further aspect of the technique, a process for integratingcomputing infrastructure comprising integrating computer readable codeinto a computer system may be provided. The computer system comprises acomputer readable medium, in which the computer medium comprises one ormore aspects of the technique. The code in combination with the computersystem is capable of performing one or more aspects of the technique.

Further, other types of computing environments can benefit from one ormore aspects of the technique. As an example, an environment may includean emulator (e.g., software or other emulation mechanisms), in which aparticular architecture (including, for instance, instruction execution,architected functions, such as address translation, and architectedregisters) or a subset thereof is emulated (e.g., on a native computersystem having a processor and memory). In such an environment, one ormore emulation functions of the emulator can implement one or moreaspects of the technique, even though a computer executing the emulatormay have a different architecture than the capabilities being emulated.As one example, in emulation mode, the specific instruction or operationbeing emulated is decoded, and an appropriate emulation function isbuilt to implement the individual instruction or operation.

In an emulation environment, a host computer includes, for instance, amemory to store instructions and data; an instruction fetch unit tofetch instructions from memory and to optionally, provide localbuffering for the fetched instruction; an instruction decode unit toreceive the fetched instructions and to determine the type ofinstructions that have been fetched; and an instruction execution unitto execute the instructions. Execution may include loading data into aregister from memory; storing data back to memory from a register; orperforming some type of arithmetic or logical operation, as determinedby the decode unit. In one example, each unit is implemented insoftware. For instance, the operations being performed by the units areimplemented as one or more subroutines within emulator software.

Further, a data processing system suitable for storing and/or executingprogram code is usable that includes at least one processor coupleddirectly or indirectly to memory elements through a system bus. Thememory elements include, for instance, local memory employed duringactual execution of the program code, bulk storage, and cache memorywhich provide temporary storage of at least some program code in orderto reduce the number of times code must be retrieved from bulk storageduring execution.

Input/Output or I/O devices (including, but not limited to, keyboards,displays, pointing devices, DASD, tape, CDs, DVDs, thumb drives andother memory media, etc.) can be coupled to the system either directlyor through intervening I/O controllers. Network adapters may also becoupled to the system to enable the data processing system to becomecoupled to other data processing systems or remote printers or storagedevices through intervening private or public networks. Modems, cablemodems, and Ethernet cards are just a few of the available types ofnetwork adapters.

The terminology used herein is for the purpose of describing particularembodiments only and is not intended to be limiting of the invention. Asused herein, the singular forms “a”, “an” and “the” are intended toinclude the plural forms as well, unless the context clearly indicatesotherwise. It will be further understood that the terms “comprises”and/or “comprising”, when used in this specification, specify thepresence of stated features, integers, steps, operations, elements,and/or components, but do not preclude the presence or addition of oneor more other features, integers, steps, operations, elements,components and/or groups thereof.

The corresponding structures, materials, acts, and equivalents of allmeans or step plus function elements in the claims below, if any, areintended to include any structure, material, or act for performing thefunction in combination with other claimed elements as specificallyclaimed. The description of the technique has been presented forpurposes of illustration and description, but is not intended to beexhaustive or limited to the invention in the form disclosed. Manymodifications and variations will be apparent to those of ordinary skillin the art without departing from the scope and spirit of the invention.The embodiment was chosen and described in order to best explain theprinciples of the invention and the practical application, and to enableothers of ordinary skill in the art to understand the invention forvarious embodiments with various modifications as are suited to theparticular use contemplated.

What is claimed is:
 1. A computer program product for determining aconvenient route, the computer program product comprising: a storagemedium readable by a processor and storing instructions for execution bythe processor to perform a method comprising: obtaining a route whereinsaid route comprises a starting point and an ending point; analyzing theroute to determine whether at least one stored route is within apre-defined acceptance zone of the route; and responsive to determiningthat at least one stored route is within a pre-defined acceptance zone,assigning a convenience factor of the at least one stored route relativeto the route.
 2. The computer program product of claim 1, wherein theassigning comprises obtaining a first distance between a first point inthe route and a first point in the at least one stored route and asecond distance between a second point in the route and a second pointin the at least one stored route and comparing the first distance andthe second distance with a third distance.
 3. The computer programproduct of claim 2, wherein the third distance comprises a distancebetween the starting point of the route and the ending point of theroute.
 4. The computer program of claim 1, wherein the acceptance zonecomprises a geographic area.
 5. The computer program product of claim 4,wherein the geographic zone is dynamic based upon a location of theobtained route.
 6. The computer program product of claim 1, furthercomprising: evaluating the convenience factor to determine whether theat least one route is a recommended route; and responsive to determiningthat the at least one route is a recommended route, communicating the atleast one route to a user.
 7. A computer system for determining aconvenient route, the computer system comprising: a memory; and aprocessor, in communications with the memory, wherein the computersystem is configured to perform a method comprising: obtaining a routewherein said route comprises a starting point and an ending point;analyzing the route to determine whether at least one stored route iswithin a pre-defined acceptance zone of the route; and responsive todetermining that at least one stored route is within a pre-definedacceptance zone, assigning a convenience factor of the at least onestored route relative to the route.
 8. The computer system of claim 7,wherein the assigning comprises obtaining a first distance between afirst point in the route and a first point in the at least one storedroute and a second distance between a second point in the route and asecond point in the at least one stored route and comparing the firstdistance and the second distance with a third distance.
 9. The computersystem of claim 8, wherein the third distance comprises a distancebetween the starting point of the route and the ending point of theroute.
 10. The computer system of claim 7, wherein the acceptance zonecomprises a geographic area.
 11. The computer system of claim 10,wherein the geographic zone is dynamic based upon a location of theobtained route.
 12. The computer system of claim 7, further comprising:evaluating the convenience factor to determine whether the at least oneroute is a recommended route; and responsive to determining that the atleast one route is a recommended route, communicating the at least oneroute to a user.
 13. A method for determining a convenient routecomprising: obtaining, by a processor, a route wherein said routecomprises a starting point and an ending point; analyzing, by theprocessor, the route to determine whether at least one stored route iswithin a pre-defined acceptance zone of the route; and responsive todetermining that at least one stored route is within a pre-definedacceptance zone, assigning a convenience factor of the at least onestored route relative to the route.
 14. The method of claim 13, whereinthe assigning comprises obtaining a first distance between a first pointin the route and a first point in the at least one stored route and asecond distance between a second point in the route and a second pointin the at least one stored route and comparing the first distance andthe second distance with a third distance.
 15. The method of claim 14,wherein the third distance comprises a distance between the startingpoint of the route and the ending point of the route.
 16. The method ofclaim 13, wherein the acceptance zone comprises a geographic area. 17.The method of claim 16, wherein the geographic zone is dynamic basedupon a location of the obtained route.
 18. The method of claim 13,further comprising: evaluating, by the processor, the convenience factorto determine whether the at least one route is a recommended route; andresponsive to determining that the at least one route is a recommendedroute, communicating the at least one route to a user.